Holographic Joint Communications and Sensing With Cramer-Rao Bounds

Joint Communication and Sensing (JCAS) technology facilitates the seamless integration of communication and sensing functionalities within a unified framework, enhancing spectral efficiency, reducing hardware complexity, and enabling simultaneous data transmission and environmental perception. This paper explores the potential of holographic JCAS systems by leveraging reconfigurable holographic surfaces (RHS) to achieve high-resolution hybrid holographic beamforming while simultaneously sensing the environment. As the holographic transceivers are governed by arbitrary antenna spacing, we first derive exact Cram\'er-Rao Bounds (CRBs) for azimuth and elevation angles to rigorously characterize the three-dimensional (3D) sensing accuracy. To optimize the system performance, we propose a novel weighted multi-objective problem formulation that aims to simultaneously maximize the communication rate and minimize the CRBs. However, this formulation is highly non-convex due to the inverse dependence of the CRB on the optimization variables, making the solution extremely challenging. To address this, we propose a novel algorithmic framework based on the Majorization-Maximization (MM) principle, employing alternating optimization to efficiently solve the problem. The proposed method relies on the closed-form surrogate functions that majorize the original objective derived herein, enabling tractable optimization. Simulation results are presented to validate the effectiveness of the proposed framework under diverse system configurations, demonstrating its potential for next-generation holographic JCAS systems.

Beyond Diagonal RIS for ISAC Network: Statistical Analysis and Network Parameter Estimation

This paper investigates the use of beyond diagonal reconfigurable intelligent surface (BD-RIS) with $N$ elements to advance integrated sensing and communication (ISAC). We address a key gap in the statistical characterizations of the radar signal-to-noise ratio (SNR) and the communication signal-to-interference-plus-noise ratio (SINR) by deriving tractable closed-form cumulative distribution functions (CDFs) for these metrics. Our approach maximizes the radar SNR by jointly configuring radar beamforming and BD-RIS phase shifts. Subsequently, zero-forcing is adopted to mitigate user interference, enhancing the communication SINR. To meet ISAC outage requirements, we propose an analytically-driven successive non-inversion sampling (SNIS) algorithm for estimating network parameters satisfying network outage constraints. Numerical results illustrate the accuracy of the derived CDFs and demonstrate the effectiveness of the proposed SNIS algorithm.

UltraRay: Full-Path Ray Tracing for Enhancing Realism in Ultrasound Simulation

Traditional ultrasound simulators solve the wave equation to model pressure distribution fields, achieving high accuracy but requiring significant computational time and resources. To address this, ray tracing approaches have been introduced, modeling wave propagation as rays interacting with boundaries and scatterers. However, existing models simplify ray propagation, generating echoes at interaction points without considering return paths to the sensor. This can result in unrealistic artifacts and necessitates careful scene tuning for plausible results. We propose a novel ultrasound simulation pipeline that utilizes a ray tracing algorithm to generate echo data, tracing each ray from the transducer through the scene and back to the sensor. To replicate advanced ultrasound imaging, we introduce a ray emission scheme optimized for plane wave imaging, incorporating delay and steering capabilities. Furthermore, we integrate a standard signal processing pipeline to simulate end-to-end ultrasound image formation. We showcase the efficacy of the proposed pipeline by modeling synthetic scenes featuring highly reflective objects, such as bones. In doing so, our proposed approach, UltraRay, not only enhances the overall visual quality but also improves the realism of the simulated images by accurately capturing secondary reflections and reducing unnatural artifacts. By building on top of a differentiable framework, the proposed pipeline lays the groundwork for a fast and differentiable ultrasound simulation tool necessary for gradient-based optimization, enabling advanced ultrasound beamforming strategies, neural network integration, and accurate inverse scene reconstruction.

On Ambisonic Source Separation with Spatially Informed Non-negative Tensor Factorization

This article presents a Non-negative Tensor Factorization based method for sound source separation from Ambisonic microphone signals. The proposed method enables the use of prior knowledge about the Directions-of-Arrival (DOAs) of the sources, incorporated through a constraint on the Spatial Covariance Matrix (SCM) within a Maximum a Posteriori (MAP) framework. Specifically, this article presents a detailed derivation of four algorithms that are based on two types of cost functions, namely the squared Euclidean distance and the Itakura-Saito divergence, which are then combined with two prior probability distributions on the SCM, that is the Wishart and the Inverse Wishart. The experimental evaluation of the baseline Maximum Likelihood (ML) and the proposed MAP methods is primarily based on first-order Ambisonic recordings, using four different source signal datasets, three with musical pieces and one containing speech utterances. We consider under-determined, determined, as well as over-determined scenarios by separating two, four and six sound sources, respectively. Furthermore, we evaluate the proposed algorithms for different spherical harmonic orders and at different reverberation time levels, as well as in non-ideal prior knowledge conditions, for increasingly more corrupted DOAs. Overall, in comparison with beamforming and a state-of-the-art separation technique, as well as the baseline ML methods, the proposed MAP approach offers superior separation performance in a variety of scenarios, as shown by the analysis of the experimental evaluation results, in terms of the standard objective separation measures, such as the SDR, ISR, SIR and SAR.

Secure Beamforming for Continuous Aperture Array (CAPA) Systems

Continuous aperture array (CAPA) is considered a promising technology for 6G networks, offering the potential to fully exploit spatial DoFs and achieve the theoretical limits of channel capacity. This paper investigates the performance gain of a CAPA-based downlink secure transmission system, where multiple legitimate user terminals (LUTs) coexist with multiple eavesdroppers (Eves). The system's secrecy performance is evaluated using a weighted secrecy sum-rate (WSSR) under a power constraint. We then propose two solutions for the secure current pattern design. The first solution is a block coordinate descent (BCD) optimization method based on fractional programming, which introduces a continuous-function inversion theory corresponding to matrix inversion in the discrete domain. This approach derives a closed-form expression for the optimal source current pattern. Based on this, it can be found that the optimal current pattern is essentially a linear combination of the channel spatial responses, thus eliminating the need for complex integration operations during the algorithm's optimization process. The second solution is a heuristic algorithm based on Zero-Forcing (ZF), which constructs a zero-leakage current pattern using the channel correlation matrix. It further employs a water-filling approach to design an optimal power allocation scheme that maximizes the WSSR. In high SNR regions, this solution gradually approaches the first solution, ensuring zero leakage while offering lower computational complexity. Simulation results demonstrate that: 1) CAPA-based systems achieve better WSSR compared to discrete multiple-input multiple-output systems. 2) The proposed methods, whether optimization-based or heuristic, provide significant performance improvements over existing state-of-the-art Fourier-based discretization methods, while considerably reducing computational complexity.

Coherence Based Sound Speed Aberration Correction -- with clinical validation in obstetric ultrasound

The purpose of this work is to demonstrate a robust and clinically validated method for correcting sound speed aberrations in medical ultrasound. We propose a correction method that calculates focusing delays directly from the observed two-way distributed average sound speed. The method beamforms multiple coherence images and selects the sound speed that maximizes the coherence for each image pixel. The main contribution of this work is the direct estimation of aberration, without the ill-posed inversion of a local sound speed map, and the proposed processing of coherence images which adapts to in vivo situations where low coherent regions and off-axis scattering represents a challenge. The method is validated in vitro and in silico showing high correlation with ground truth speed of sound maps. Further, the method is clinically validated by being applied to channel data recorded from 172 obstetric Bmode images, and 12 case examples are presented and discussed in detail. The data is recorded with a GE HealthCare Voluson Expert 22 system with an eM6c matrix array probe. The images are evaluated by three expert clinicians, and the results show that the corrected images are preferred or gave equivalent quality to no correction (1540m/s) for 72.5% of the 172 images. In addition, a sharpness metric from digital photography is used to quantify image quality improvement. The increase in sharpness and the change in average sound speed are shown to be linearly correlated with a Pearson Correlation Coefficient of 0.67.

Enhancing Spectrum Efficiency in 6G Satellite Networks: A GAIL-Powered Policy Learning via Asynchronous Federated Inverse Reinforcement Learning

In this paper, a novel generative adversarial imitation learning (GAIL)-powered policy learning approach is proposed for optimizing beamforming, spectrum allocation, and remote user equipment (RUE) association in NTNs. Traditional reinforcement learning (RL) methods for wireless network optimization often rely on manually designed reward functions, which can require extensive parameter tuning. To overcome these limitations, we employ inverse RL (IRL), specifically leveraging the GAIL framework, to automatically learn reward functions without manual design. We augment this framework with an asynchronous federated learning approach, enabling decentralized multi-satellite systems to collaboratively derive optimal policies. The proposed method aims to maximize spectrum efficiency (SE) while meeting minimum information rate requirements for RUEs. To address the non-convex, NP-hard nature of this problem, we combine the many-to-one matching theory with a multi-agent asynchronous federated IRL (MA-AFIRL) framework. This allows agents to learn through asynchronous environmental interactions, improving training efficiency and scalability. The expert policy is generated using the Whale optimization algorithm (WOA), providing data to train the automatic reward function within GAIL. Simulation results show that the proposed MA-AFIRL method outperforms traditional RL approaches, achieving a $14.6\%$ improvement in convergence and reward value. The novel GAIL-driven policy learning establishes a novel benchmark for 6G NTN optimization.

Off-Grid Ultrasound Imaging by Stochastic Optimization

Ultrasound images formed by delay-and-sum beamforming are plagued by artifacts that only clear up after compounding many transmissions. Some prior works pose imaging as an inverse problem. This approach can yield high image quality with few transmits, but requires a very fine image grid and is not robust to changes in measurement model parameters. We present INverse grid-Free Estimation of Reflectivities (INFER), an off-grid and stochastic algorithm that solves the inverse scattering problem in ultrasound imaging. Our method jointly optimizes for the locations of the gridpoints, their reflectivities, and the measurement model parameters such as the speed of sound. This approach allows us to use significantly fewer gridpoints, while obtaining better contrast and resolution and being more robust to changes in the imaging target and the hardware. The use of stochastic optimization enables solving for multiple transmissions simultaneously without increasing the required memory or computational load per iteration. We show that our method works across different imaging targets and across different transmit schemes and compares favorably against other beamforming and inverse solvers. The source code and the dataset to reproduce the results in this paper are available at www.github.com/vincentvdschaft/off-grid-ultrasound.

Robust Broadband Beamforming using Bilinear Programming

We introduce a new method for robust beamforming, where the goal is to estimate a signal from array samples when there is uncertainty in the angle of arrival. Our method offers state-of-the-art performance on narrowband signals and is naturally applied to broadband signals. Our beamformer operates by treating the forward model for the array samples as unknown. We show that the "true" forward model lies in the linear span of a small number of fixed linear systems. As a result, we can estimate the forward operator and the signal simultaneously by solving a bilinear inverse problem using least squares. Our numerical experiments show that if the angle of arrival is known to only be within an interval of reasonable size, there is very little loss in estimation performance compared to the case where the angle is known exactly.

Fast Fractional Programming for Multi-Cell Integrated Sensing and Communications

This paper concerns the coordinate multi-cell beamforming design for integrated sensing and communications (ISAC). In particular, we assume that each base station (BS) has massive antennas. The optimization objective is to maximize a weighted sum of the data rates (for communications) and the Fisher information (for sensing). We first show that the conventional beamforming method for the multiple-input multiple-output (MIMO) transmission, i.e., the weighted minimum mean square error (WMMSE) algorithm, has a natural extension to the ISAC problem scenario from a fractional programming (FP) perspective. However, the extended WMMSE algorithm requires computing the $N\times N$ matrix inverse extensively, where $N$ is proportional to the antenna array size, so the algorithm becomes quite costly when antennas are massively deployed. To address this issue, we develop a nonhomogeneous bound and use it in conjunction with the FP technique to solve the ISAC beamforming problem without the need to invert any large matrices. It is further shown that the resulting new FP algorithm has an intimate connection with gradient projection, based on which we can accelerate the convergence via Nesterov's gradient extrapolation.